#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
map<char,LL>map1;
int main(void)
{
  ///cin.tie(0);std::ios::sync_with_stdio(false);
  string a;cin>>a;
  string b;cin>>b;
  for(LL i=0;i<a.size();i++){
    map1[a[i]]++;
  }/*
  for(auto i:map1){
    cout<<i.first<<" ";
  }
  cout<<"\n";*/
  if(b=="S"){
    if(map1.count('B')){
        cout<<"pmznb"<<'\n';
    }
    else if(map1.count('S')){
        cout<<"lyrnb"<<'\n';
    }
    else if(map1.count('J')){
        cout<<"ljrnb"<<'\n';
    }
  }
  if(b=="J"){
    if(map1.count('S')){
        cout<<"pmznb"<<'\n';
    }
    else if(map1.count('J')){
        cout<<"lyrnb"<<'\n';
    }
    else if(map1.count('B')){
        cout<<"ljrnb"<<'\n';
    }
  }
  if(b=="B"){
    if(map1.count('J')){
        cout<<"pmznb"<<'\n';
    }
    else if(map1.count('B')){
        cout<<"lyrnb"<<'\n';
    }
    else if(map1.count('S')){
        cout<<"ljrnb"<<'\n';
    }
  }
return 0;
}
